This repository was archived by the owner on Mar 18, 2024. It is now read-only.
[2023-08-28] wooyeol #144#167
Merged
Merged
Conversation
Closed
limstonestone
approved these changes
Aug 28, 2023
Contributor
limstonestone
left a comment
There was a problem hiding this comment.
1번 단계와 3번 단계의 조건문을 적절히 합치는(분리하는?) 방법이 없었을까요?!
전체적인 풀이 로직은 비슷한 것 같습니다!!
저는 chr 함수에 알파벳 숫자를 까먹어서 못썼어요 ㅋㅋㅋ 이번 기회에 다시 상기하고 갑니다 .. ㅎ
감사합니다 ~!
zsmalla
approved these changes
Aug 28, 2023
Contributor
zsmalla
left a comment
There was a problem hiding this comment.
주석을 활용해 절차별로 코드를 구분해주셔서 읽기에 편했습니다. 저는 인덱스를 활용해 우열님과 거의 동일하게 문제를 풀 수 있었던 것 같아요! 이렇게 직접 문자열을 활용하는 편도 이해하기 쉽고 좋았던 것 같습니다.
ksumini
approved these changes
Aug 28, 2023
Contributor
There was a problem hiding this comment.
문제에 주어진 조건대로 구현하시고 주석을 달아주셔서 직관적으로 이해가 되는 코드인것 같아요! 👍👍👍
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
4 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
압축
https://school.programmers.co.kr/learn/courses/30/lessons/17684
풀이시간 22:30 ~ 23:00 | 23:53 ~ 00:27 (1시간 4분)
시간복잡도
O(n) - n은 msg의 길이(1~1000)
접근법
무슨 알고리즘으로 풀이 할 수 있을까? -> 구현